Means and minimization of errors
نویسندگان
چکیده
منابع مشابه
Minimization power and non-linearity errors with split SAR ADC
This paper introduces the linearity analysis of a progressive successive approximation registers (SAR) simple toadvanced converters (ADC) with part DAC structure taking into account two exchanging techniques: conventional charge-redistribution and Vcm-based switching. The static linearity execution, in particular the fundamental nonlinearity and differential nonlinearity, and in addition the pa...
متن کاملcollocation errors in translations of the holy quran
the present study aims at identifying, classifying and analyzing collocation errors made by translators of the holy quran into english.findings indicated that collocationally the most acceptablt translation was done by ivring but the least appropriate one made by pickthall.
Standard Errors of Fitted Component Means of Normal Mixtures
In this paper use consider the problem of providing standard errors of the component means in normal mixture models tted to univariate or multi-variate data by maximumlikelihood via the EM algorithm. Two methods of estimation of the standard errors are considered: the standard information-based method and the computationally-intensive bootstrap method. They are compared empirically by their app...
متن کاملAn Algorithm for Nonsmooth Convex Minimization With Errors
A readily implementable algorithm is given for minimizing any convex, not necessarily differentiable, function/of several variables. At each iteration the method requires only one approximate evaluation of /and its E-subgradient, and finds a search direction by solving a small quadratic programming problem. The algorithm generates a minimizing sequence of points, which converges to a solution w...
متن کاملA Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors
A decomposition algorithm based on proximal bundle-type method with inexact data is presented for minimizing an unconstrained nonsmooth convex function f . At each iteration, only the approximate evaluation of f and its approximate subgradients are required which make the algorithm easier to implement. It is shown that every cluster of the sequence of iterates generated by the proposed algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
سال: 1968
ISSN: 0098-8979
DOI: 10.6028/jres.072b.002